Comparative Study of Hyperelliptic Curve Cryptosystem over Prime Field and Its Survey
نویسندگان
چکیده
Public key cryptography is the famous cryptography technique used in many corporate sectors for developing software to provide security services. Hyperelliptic Curve Cryptosystem (HECC) is one of the public key cryptographic technique, an expansion of Elliptic Curve Cryptography which offers the similar level of security compared with other cryptosystems such as RSA, ECC and DSA. HECC supervise the ECC due to shorter operand size. This paper will analysis the performance of HECC over genus curve 2, 3, 4, 5, 6 and compares the result with ECC. It also inspects the use of Hyperelliptic Curve Cryptography technique and affords complete survey on its performance for many applications.
منابع مشابه
Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y2=x2k+1+ax
Computing the order of the Jacobian group of a hyperelliptic curve over a finite field is very important to construct a hyperelliptic curve cryptosystem (HCC), because to construct secure HCC, we need Jacobian groups of order in the form l · c where l is a prime greater than about 2 and c is a very small integer. But even in the case of genus two, known algorithms to compute the order of a Jaco...
متن کاملSoftware Implementation of Genus-2 Hyperelliptic Curve Cryptosystems Over Prime Fields
This paper describes the system parameters and software implementation of a HECDSA cryptosystem based on genus-2 hyperelliptic curves over prime fields. We show how to reduce the computational complexity for special cases and compare the given cryptosystem with the well-known ECDSA cryptosystem based on elliptic curves.
متن کاملComputing the Characteristic Polynomials of a Class of Hyperelliptic Curves for Cryptographic Applications
Hyperelliptic curves have been widely studied for cryptographic applications, and some special hyperelliptic curves are often considered to be used in practical cryptosystems. Computing Jacobian group orders is an important operation in constructing hyperelliptic curve cryptosystems, and the most common method used for the computation of Jacobian group orders is by computing the zeta functions ...
متن کاملCounting Points on the Jacobian Variety of a
Counting the order of the Jacobian group of a hyperelliptic curve over a nite eld is very important for constructing a hyperelliptic curve cryptosystem (HECC), but known algorithms to compute the order of a Jacobian group over a given large prime eld need very long running times. In this note, we propose a practical polynomial-time algorithm to compute the order of the Jacobian group for a hype...
متن کاملFast Endomorphism for any Genus 2 Hyperelliptic Curve over a Finite Field of Even Characteristic
In EUROCRYPT 2009, Galbraith, Lin and Scott constructed an efficiently computable endomorphism for a large family of elliptic curves defined over finite fields of large characteristic. They demonstrated that the endomorphism can be used to accelerate scalar multiplication in the elliptic curve cryptosystem based on these curves. In this paper we extend the method to any genus 2 hyperelliptic cu...
متن کامل